Parallel Kalman Filtering on the Connection Machine

A parallel algorithm for square root Kalman filtering is developed and implemented on the Connection Machine (CM). The algorithm makes efficient use of parallel prefix or scan operations which are primitive instructions in the CM. Performance measurements show that the CM filter runs in time linear in the state vector size. This represents a great improvement over serial implementations which run in cubic time. A specific multiple target tracking application is also considered, in which several targets (e.g., satellites, aircrafts and missiles) are to be tracked simultaneously, each requiring one or more filters. A parallel algorithm is developed which, for fixed size filters, runs in constant time, independent of the number of filters simultaneously processed. Comments University of Pennsylvania Department of Computer and Information Science Technical Report No. MSCIS-90-81. This technical report is available at ScholarlyCommons: http://repository.upenn.edu/cis_reports/816 Parallel Kalman Filtering On The Connection Machine MS-CIS-90-81 LINC LAB 186 Michael A. Palis University of Pennsylvania Donald K. Krecker General Electric Company Department of Computer and Information Science School of Engineering and Applied Science University of Pennsylvania Philadelphia, PA 19104-6389